Welcome![Sign In][Sign Up]
Location:
Search - Java tree

Search list

[Data structs20043048

Description: 动态演示各种数据结构的定义和操作: 实现过程: 建立一棵二叉树,并在所建立的二叉树中可在任意结点位置插入其左右孩子。 画出你所建的这棵二叉树,并能动态反映你所插结点的过程(具有可视化,彩色,美观的效果) 能查找任一结点的左右孩子 能查找任一结点的左右邻兄弟 能查找任一结点的父亲 能删除任一结点 能对树进行各种遍历-Dynamic demonstration of the definition of various data structures and operations: the realization of the process: the establishment of a binary tree and binary tree created can be in any position to insert node about its children. Draw your tree built binary tree, and you can dynamically reflect the process of interpolation nodes (with a visualization, color, aesthetic effects) can search any one node around children can search for any node o brothers around the search term can be the father of one node can delete any node can conduct various kinds of tree traversal
Platform: | Size: 13312 | Author: 许磊 | Hits:

[Compress-Decompress algrithms200430481

Description: 赫夫曼编译码器: 用哈夫曼编码进行通信可以大大提高信道利用率,缩短信息传输时间,降低传输成本。但是,这要求在发送端通过一个编码系统对待传数据预先编码,在接收端将传来的数据进行译码(复原)。对于双工信道(即可以双向传输信息的信道),每端都需要一个完整的编/译码系统。试为这样的信息收发站写一个哈夫曼码的编/译码系统。 [基本要求]一个完整的系统应具有以下功能: (1)I:初始化(Initialization)。从终端读入字符集大小n,以及n个字符和n个权值,建立哈夫曼树,并将它存于文件hfmTree中。 (2)E:编码(Encoding)。利用已建好的哈夫曼树(如不在内存,则从文件hfmTree中读入),对文件ToBeTran中的正文进行编码,然后将结果存入文件CodeFile中。 (3)D:译码(Decoding)。利用已建好的哈夫曼树将文件CodeFile中的代码进行译码,结果存入文件TextFile中。 (4)P:印代码文件(Print)。将文件CodeFile以紧凑格式显示在终端上,每行50个代码。同时将此字符形式的编码文件写入文件CodePrin中。 (5)T:印哈夫曼树(Tree printing)。将已在内存中的哈夫曼树以直观的方式(树或凹入表形式)显示出,同时将此字符形式的哈夫曼树写入文件TreePrint中。
Platform: | Size: 204800 | Author: 许磊 | Hits:

[Data structsGraphW

Description: 最小生成树 支持鼠标点击生成结点 并且动态生成最小树-Minimum Spanning Tree support mouse clicks generated dynamically generated nodes and minimum spanning tree
Platform: | Size: 106496 | Author: 黄易 | Hits:

[Mathimatics-Numerical algorithmsId3

Description: 决策树在Weka中的设计与实现,数据的属性要是名词性的。-Weka decision tree in the design and realization of the attributes of data if the term in nature.
Platform: | Size: 3072 | Author: snow | Hits:

[TreeViewBxTree

Description: Here is a demo on B plus tree~
Platform: | Size: 7168 | Author: Chan Fuk Wai | Hits:

[JSP/JavaID3

Description: ID3算法的JAVA实现,在WEKA平台上实现的-ID3 algorithm JAVA realize, in the WEKA platform realize the
Platform: | Size: 5120 | Author: longhaoqiu | Hits:

[Windows Developtree45_VC

Description: 决策树的程序,希望对大家有帮助,相互学习-Decision tree process, and they hope to help everyone learn from each other
Platform: | Size: 64512 | Author: nieddd | Hits:

[Other Web Codejava

Description: 下拉框的监听引,树的监听引用,有非常详细的 注释-Monitor cited the drop-down box, tree listening to quote, there are very detailed notes
Platform: | Size: 2048 | Author: 腾达 | Hits:

[JSP/Javashuxingcaidan

Description: 两个树形菜单,你可以根据自己的需要来选择用哪一个-Two tree-like menu, you can according to their own needs to choose which one to use
Platform: | Size: 25600 | Author: cyb | Hits:

[JSP/JavaC4.5

Description: C4.5算法有如下优点:产生的分类规则易于理解,准确率较高。其缺点是:在构造树的过程中,需要对数据集进行多次的顺序扫描和排序,因而导致算法的低效。此外,C4.5只适合于能够驻留于内存的数据集,当训练集大得无法在内存容纳时程序无法运行。-C4.5 algorithm has the following advantages: the classification rules easier to understand, accurate and a higher rate. Its shortcomings are as follows: in the tree structure, the need for a number of data sets the order of scanning and sorting, thus leading to inefficient algorithms. In addition, C4.5 can only be applied to the presence of a data set in memory, when the training set too great to accommodate in memory when the program can not run.
Platform: | Size: 1024 | Author: xinyuanwo | Hits:

[JSP/JavaBTree

Description: java版b树源码,已经调试过,很好,很强大,希望对大家有所帮助。-b tree java source version has debugging, and very good, very powerful and we hope to be helpful.
Platform: | Size: 7168 | Author: willee | Hits:

[JSP/JavaKdTree

Description: 用Java编写的KD TREE算法实现, 希望对大家有所帮助-Java prepared using KD TREE algorithm, I hope all of you to help
Platform: | Size: 1024 | Author: 阎贺 | Hits:

[JSP/JavaRedBlackTree

Description: 用Java编写的红黑树算法实现,希望对大家有所帮助-Java prepared using red and black tree algorithm, I hope all of you to help
Platform: | Size: 2048 | Author: 阎贺 | Hits:

[JSP/Javatree

Description: useing java to show a tree,like windows tr-useing java to show a tree, like windows tr
Platform: | Size: 1024 | Author: 石雅松 | Hits:

[JSP/Javazhicun

Description: 系统特色: 1,栏目无限级分类,形成树型结构,可以随意增加,修改,移动,删除栏目,移动或删除栏目的同时系统自动移动或删除其对应子栏目和信息。 2,系统支持国际化,采用UTF-8编码,资源文件里可以设置多国语言,形成多国语言界面。 3,系统采用Struts标签制,避免Jsp页面出java代码。 3,完全生成前台静态页面,大大提高网民浏览前台页面的速度,降低服务器的资源开销。 4,集成最新编辑器(eWebEditor V4.60),实现所见即所得的效果 后台登陆地址:admin/login.jsp 登陆管理名称为:admin123 密码:admin123-System Characteristics: 1, columns limitless class classification, the formation of tree structure, can add, modify, move, delete columns, move, or delete columns, while the system automatically move or delete the corresponding sub-sections and information. 2, system supports internationalization, the use of UTF-8 encoding, resource documents in multiple languages can be set to form a multi-language interface. 3, the system using Struts labeling system to avoid a java code jsp page. 3, completely generate the static front page, greatly improve the prospects of Internet users browse the page the speed and reduce server overhead resources. 4, integration of the latest editor (eWebEditor V4.60), the effect of the background to realize WYSIWYG landing Address: admin/login.jsp landing management name: admin123 password: admin123
Platform: | Size: 3533824 | Author: huan | Hits:

[Data structshuffman

Description: 输入一段英文字符,试为该文中的每个字符编制相应的哈夫曼码。 (1)I:初始化(Initialization)。对输入的一段英文中的每个字符统计其权值,建立哈夫曼树; (2)E:编码(Encoding)。利用已建好的哈夫曼树,对每个字符进行编码。 (3)D:译码(Decoding)。利用已建好的每个编码,对输入的一个由0、1组成的序列进行译码; (4)P:印代码文件(Print)。将每个字符编的哈夫曼码和译码结果显示在终端上。 -Enter a period of English characters, try the text for each character corresponding Huffman code. (1) I: Initialization (Initialization). A section of the input English characters statistics for each value of its right to establish a Huffman tree (2) E: encoding (Encoding). Has been built using Huffman tree for each character encoding. (3) D: Decoding (Decoding). Use has been completed for each encoding, the input of a sequence consisting of 0,1 Decoding (4) P: Printing code files (Print). Will be allocated for each character code and the Huffman decoding results are displayed in terminal.
Platform: | Size: 2048 | Author: alic | Hits:

[Compress-Decompress algrithmshuffman

Description: /** * 显示输入提示压缩或解压缩 继承了InputStream类,装有输入流。 */ public class HZIPInputStream extends InputStream { /** * HZIPInputStream 类的构造函数,定义了huffman树,输入流。 * * @param in 输入流。 * @throws IOException:如果发生I/O错误则抛出异常。 */-/*** Show input prompts compression or decompression InputStream inherited categories, with input streams.*/public class HZIPInputStream extends InputStream (/*** HZIPInputStream class constructor, the definition of a huffman tree, enter the stream.** @ Param in input stream.* @ Throws IOException: if there is I/O error is thrown.* /
Platform: | Size: 75776 | Author: stone | Hits:

[ADO-ODBCc45

Description: 该代码是数据挖掘里面的决策树算法 利用c45理论,通过对训练数据的分析判断,计算出各个数据的其它对目标属性的重要程度,即计算出每个其它数据的信息增益值来将训练数据逐步分类,最后得出目标分类,从而实现决策树的生成过程。最后即可利用此决策树来对新的数据进行测试,判断其目标属性的可能值。-The code is a data mining using decision tree algorithm inside the C45 theory, through the analysis of training data to calculate all the other data attributes on the target level of importance, that is, every other data to calculate the information gain value of the training data Category gradually came to the conclusion that the target classification, in order to realize the process of decision tree generation. Finally you can use this decision tree to test the new data to determine its target attributes possible values.
Platform: | Size: 769024 | Author: zkm | Hits:

[Data structsDC

Description: 基于图形的二叉树工作演示程序,包括创建、查找、插入、删除操作。-The binary tree-based graphical presentation of work procedures, including creation, search, insert, delete operation.
Platform: | Size: 239616 | Author: PLUM | Hits:

[Windows DevelopArrayTree

Description: 1. 用一个一维数组保存二叉树结点。 2. 实现二叉树节点的返回左孩子,返回右孩子,添加结点 3. 层序遍历二叉树。 -1. With a one-dimensional array to preserve binary tree nodes. 2. The realization of binary tree nodes to return to the left child, return the right child, add the node 3. Binary tree traversal sequence.
Platform: | Size: 1024 | Author: fangxuerong | Hits:
« 1 2 ... 8 9 10 11 12 1314 15 16 17 18 ... 50 »

CodeBus www.codebus.net